Variations of Knapsack Problem Relevant to Interactive Rendering
نویسنده
چکیده
We explain how the Knapsack problem and interactive rendering are related. We also discuss several additional concerns regarding interactive rendering and how these affect the solution to the original Knapsack problem. Lastly, we present two approximate algorithms and compare how they meet the needs of interactive rendering. 1 Background Knapsack Problem We are given a set of n items, S = x1, x2, ..., xn. Each item has a weight, w(x1), w(x2), ..., w(xn) and value, v(x1), v(x2), ..., v(xn). The Knapsack problem is to find S , a subset of S, such that: ∑ y∈S v(y) is maximized over S and ∑ y∈S w(y) ≤ c where c is the capacity of the knapsack. This problem is NP-Complete [8] because a polynomial time checker can verify a solution but the best algorithm for determining the solution is O(n2), where k is the number of bits used to represent the capacity of the knapsack and the weights of each item [4]. Interactive Rendering Rendering is the process of creating a 2-dimensional image from a 3-dimensional scene consisting of objects, lights, cameras and other entities. Interactive rendering is doing this conversion fast enough that a user can provide input and get feedback almost instantaneously. Interactive rendering is useful in different contexts such as architectural evaluation of buildings, CAD applications, game playing and simulations. Interactive rendering is made possible by advances in graphics card hardware. However, the time required to render a scene is input-dependent. That is, as more objects are added to the scene, the render time increases even if the final 2D image is of the same size. This makes interactive rendering of large scenes challenging.
منابع مشابه
An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کامل